Tutorial Intro

● About Tutorial

✦Why here - Tutorialix.com

✦Faqs on Learning Java

Introduction

● Java Overview

✦What is Java

✦History of Java

✦Power of Java

✦Uses of Java

✦Java vs C++

✦Java vs Python

✦Java vs C-Sharp

✦Java vs Other Languages

✦JVM and Installation

✦JRE and Installation

✦JDK and Installation

✦JDK vs JVM vs JRE

✦Future of Java

✦Java career and salary

Java Basics

● Java first code

✦Java - Hello world

✦Java Structure

● Java Datatypes

✦Datatypes in Java

✦Primitive vs Non-Primitive

✦Byte in Java

✦Short in Java

✦Int in Java

✦Long in Java

✦Float in Java

✦Double in Java

✦Char in Java

✦Boolean in Java

● Java Variables

✦Variables in Java

✦Types of variables

✦Dynamic variable Initialization

✦Scope and Lifetime of a Variable

● Java Operators

✦Operators in Java

✦Arithmetic operator

✦Assignment operator

✦Bitwise operator

✦Relational operator

✦Logical operator

✦Unary operator

✦Ternary operator

✦instanceof operator

✦Operator precedence

● Java Keywords

✦About keywords

✦Keywords list

● Identifiers & Modifiers

✦Identifiers in java

✦Modifiers in java

● Typecasting

✦Typecasting & its types

✦Upcasting and downcasting

● comments

✦comments in java

● Input and output

✦Input

✦Output in Java

Conditional Statements

● Overview

✦Types and definition

● If

✦If in Java

✦If examples

● Else if

✦Else if syntax & explanation

✦Else if examples-1

✦Else if examples-2

● Nested If

✦Nested If - syntax & uses

✦Nested If - Example - 1

✦Nested If - Example - 2

● if-else ladder

✦if-Else if ladder

✦Else if ladder examples

● Jump Statements

✦Break in Java

✦Continue in Java

✦Return in Java

● Switch

✦Switch in Java

✦Switch examples

● Ternary Operator

✦Ternary operator in Java

✦Ternary operator example

Looping Statements

● Introduction

✦Loops in java

✦comparing Loops

● For Loop

✦For loop in java

✦For loop examples - Set 1

✦For loop examples - Set 2

● For - Each Loop

✦For-Each in java

✦For-Each Examples set -1

✦For-Each Examples set -2

● While Loop

✦While in Java

✦While examples

● Do-while Loop

✦do-while

✦do-while loop examples

● Nested Loops

✦Nested loops in Java

✦Nested loops example - 1

✦Nested loops example - 2

Array

● Array Basics

✦Array Introduction

✦Array basic examples

✦Array length property

✦ArrayIndexOutOfBoundsException

● Multidimensional Array

✦Multidimensional Arrays in Java

✦2D and 3D array in java

✦Jagged Array

✦3D Array examples

✦Jagged array examples

● Array and Objects

✦Array of Objects

✦Arrays as parameter

✦Array in return

● Array methods

✦java.util.array

Strings

● String basics

✦String intro

✦String declaration & Initialization

✦Numbers in String

✦Escape sequence in java

✦String Iteration

✦String concatenation in Java

● StringBuilder and Buffer

✦StringBuilder and StringBuffer

✦StringBuilder Methods

Class, Method & Object

● Class, Method & Object Introduction

✦Class, Method & Object Basics

● Class

✦Class in Java

✦Class members

✦constructors

✦Nested Classes

● Method

✦method in java

✦Parameter & Arguments

✦Return in java

● Object

✦object in java

✦Instance methods & variables

✦object initialization

OOPS

● oops Introduction

✦oops in java

● oops Method

✦Method in oops

✦Method recursion

✦keyword-new

✦Reference variable

● Object in oops

✦Object in oops

● Class in oops

✦class in oops

✦Inheritance & subclass

✦Final and Abstract class

Inheritance

● Inheritance Basics

✦Inheritance

✦Subclass and superclass

● Inheritance Concept

✦Extend keyword

✦Method Overriding

✦super

✦Inheriting constructors

● Types of Inheritance

✦Inheritance types

✦Single Inheritance

✦Multilevel Inheritance

✦Hierarchical inheritance

✦Hybrid inheritance

✦Multiple inheritance

Polymorphism

● Polymorphism in java

✦Polymorphism Intro

✦Polymorphism types

✦Constructor overloading

✦Superclass & subclass

✦@Override

Abstraction

● Abstraction in java

✦Abstraction Intro

✦Abstract class

✦Abstract method

✦Abstract vs Concrete

Encapsulation

● Encapsulation in java

✦Encapsulation Intro

✦Access modifiers

✦Getters and Setters

Interface

● Interface in java

✦Interface Intro

✦Interface methods

✦Multiple interfaces

Exception Handling

● Exceptions in java

✦Exception handling basics

✦Type of exceptions

✦try-catch block

✦Multiple try-catch

✦Throw in Java

✦Finally in Java

File Handling

● File Handling in java

✦Intro

✦Create file

✦Read file

✦Write file

✦Rename file

✦Delete file

✦Create directory

Java Collections

● Collection framework

✦Intro

✦Iterator

● List Interface

✦Overview

✦List iterator

● Arraylist

✦Java Arraylist

● LinkedList

✦Java LinkedList

● Vector

✦Vector in Java

● Stack

✦Stack in Java

● Queue Interface

✦Queue in Java

● PriorityQueue

✦PriorityQueue in Java

✦PriorityQueue constructors

● Queue LinkedList

✦Linkedlist as Queue

● Dequeue Interface

✦Dequeue in Java

● ArrayDeque

✦ArrayDeque in Java

● Set Interface

✦Set in Java

● HashSet

✦Java HashSet

● LinkedHashSet

✦Java LinkedHashSet

● EnumSet

✦Java EnumSet

● SortedSet

✦SortedSet Interface

● TreeSet

✦Java TreeSet

● Map Interface

✦Map in Java

● HashMap

✦Java HashMap

● LinkedHashMap

✦Java LinkedHashMap

● WeakHashMap

✦Java WeakHashMap

● EnumMap

✦Java EnumMap

● SortedMap Interface

✦SortedMap

● TreeMap

✦Java TreeMap

Java Multithreading

● Multithreading

✦Multithreading Intro

✦Thread Lifecycle

✦Creating Thread

✦Starting Thread

✦Joining Thread

✦Naming Thread

✦Scheduling Thread

Java Generics

● Generics

✦Introduction to Generics

✦Generic Classes

✦Generic Interfaces

✦Type Parameters and arguments

✦Generic Methods

✦Wildcards in Generics

✦Unbounded Wildcards

✦Upper Bounded Wildcards

✦Lower Bounded Wildcards

Java Networking

● Networking

✦Networking

✦Socket Programming

✦URL Processing

✦URL Class

✦URLConnection Class

✦HttpURLConnection Class

✦Socket Class

✦ServerSocket Class

✦InetAddress Class

Java Jdbc

● Jdbc in Java

✦JDBC Introduction

✦JDBC Driver

✦JDBC DB Connectivity Steps

✦JDBC Connectivity with Oracle

✦JDBC Connectivity with MySQL

✦JDBC Access without DSN

✦JDBC DriverManager

✦JDBC Connection

✦JDBC Statement

✦JDBC ResultSet

✦JDBC PreparedStatement

✦JDBC ResultSetMetaData

✦JDBC DatabaseMetaData

✦JDBC Store image

✦JDBC Retrieve image

✦JDBC Store file

✦JDBC Retrieve file

✦JDBC CallableStatement

✦JDBC Transaction Management

✦JDBC Batch Processing

Reference

● Math methods

✦math abs(double a)

✦math abs(float a)

✦math abs(int a)

✦math abs(long a)

✦math acos(double a)

✦math addExact(int x, int y)

✦math addExact(long x, long y)

✦math asin(double a)

✦math atan(double a)

✦math atan2(double y, double x)

✦math cbrt(double a)

✦math ceil(double a)

✦math copySign(double magnitude, double sign)

✦math copySign(float magnitude, float sign)

✦math cos(double a)

✦math cosh(double x)

✦math decrementExact(int a)

✦math decrementExact(long a)

✦math exp(double a)

✦math expm1(double x)

✦math floor(double a)

✦math floorDiv(int x, int y)

✦math floorDiv(long x, long y)

✦math floorMod(int x, int y)

✦math floorMod(long x, long y)

✦math getExponent(double d)

✦math getExponent(float f)

✦math hypot(double x, double y)

✦math IEEEremainder(double f1, double f2)

✦math incrementExact(int a)

✦math incrementExact(long a)

✦math log(double a)

✦math log10(double a)

✦math log1p(double x)

✦math max(double a, double b)

✦math max(float a, float b)

✦math max(int a, int b)

✦math max(long a, long b)

✦math min(double a, double b)

✦math min(float a, float b)

✦math min(int a, int b)

✦math min(long a, long b)

✦math multiplyExact(int x, int y)

✦math multiplyExact(long x, long y)

✦math negateExact(int a)

✦math negateExact(long a)

✦math nextAfter(double start, double direction)

✦math nextAfter(float start, double direction)

✦math nextDown(double d)

✦math nextDown(float f)

✦math nextUp(double d)

✦math nextUp(float f)

✦math pow(double a, double b)

✦math random()

✦math rint(double a)

✦math round(double a)

✦math round(float a)

✦math scalb(double d, int scaleFactor)

✦math scalb(float f, int scaleFactor)

✦math signum(double d)

✦math signum(float f)

✦math sin(double a)

✦math sinh(double x)

✦math sqrt(double a)

✦math subtractExact(int x, int y)

✦math subtractExact(long x, long y)

✦math tan(double a)

✦math tanh(double x)

✦math toDegrees(double angrad)

✦math toIntExact(long value)

✦math toRadians(double angdeg)

✦math ulp(double d)

✦math ulp(float f)

● String methods

✦String charAt(int index)

✦String codePointAt(int index)

✦String codePointBefore(int index)

✦String codePointCount(int beginIndex, int endIndex)

✦String compareTo(String anotherString)

✦String compareToIgnoreCase(String str)

✦String concat(String str)

✦String contains(CharSequence s)

✦String contentEquals(CharSequence cs)

✦String contentEquals(StringBuffer sb)

✦String copyValueOf(char[] data)

✦String copyValueOf(char[] data, int offset, int count)

✦String endsWith(String suffix)

✦String equals(Object anObject)

✦String equalsIgnoreCase(String anotherString)

✦String format(Locale l, String format, Object... args)

✦String format(String format, Object... args)

✦String getBytes()

✦String getBytes(Charset charset)

✦String getBytes(int srcBegin, int srcEnd, byte[] dst, int dstBegin)

✦String getBytes(String charsetName)

✦String getChars(int srcBegin, int srcEnd, char[] dst, int dstBegin)

✦String hashCode()

✦String indexOf(int ch)

✦String indexOf(int ch, int fromIndex)

✦String indexOf(String str)

✦String indexOf(String str, int fromIndex)

✦String intern()

✦String isEmpty()

✦String join(CharSequence delimiter, CharSequence... elements)

✦String join(CharSequence delimiter, Iterable<? extends CharSequence> elements)

✦String lastIndexOf(int ch)

✦String lastIndexOf(int ch, int fromIndex)

✦String lastIndexOf(String str)

✦String lastIndexOf(String str, int fromIndex)

✦String length()

✦String matches(String regex)

✦String offsetByCodePoints(int index, int codePointOffset)

✦String regionMatches(boolean ignoreCase, int toffset, String other, int ooffset, int len)

✦String regionMatches(int toffset, String other, int ooffset, int len)

✦String replace(char oldChar, char newChar)

✦String replace(CharSequence target, CharSequence replacement)

✦String replaceAll(String regex, String replacement)

✦String replaceFirst(String regex, String replacement)

✦String split(String regex)

✦String split(String regex, int limit)

✦String startsWith(String prefix)

✦String startsWith(String prefix, int toffset)

✦String subSequence(int beginIndex, int endIndex)

✦String substring(int beginIndex)

✦String substring(int beginIndex, int endIndex)

✦String toCharArray()

✦String toLowerCase()

✦String toLowerCase(Locale locale)

✦String toString()

✦String toUpperCase()

✦String toUpperCase(Locale locale)

✦String trim()

✦String valueOf(boolean b)

✦String valueOf(char c)

✦String valueOf(char[] data)

✦String valueOf(char[] data, int offset, int count)

✦String valueOf(double d)

✦String valueOf(float f)

✦String valueOf(int i)

✦String valueOf(long l)

✦String valueOf(Object obj)

● Array methods

✦array asList(T... a)

✦array binarySearch(byte[] a, byte key)

✦array binarySearch(byte[] a, int fromIndex, int toIndex, byte key)

✦array binarySearch(char[] a, char key)

✦array binarySearch(char[] a, int fromIndex, int toIndex, char key)

✦array binarySearch(double[] a, double key)

✦array binarySearch(double[] a, int fromIndex, int toIndex, double key)

✦array binarySearch(float[] a, float key)

✦array binarySearch(float[] a, int fromIndex, int toIndex, float key)

✦array binarySearch(int[] a, int key)

✦array binarySearch(int[] a, int fromIndex, int toIndex, int key)

✦array binarySearch(long[] a, int fromIndex, int toIndex, long key)

✦array binarySearch(long[] a, long key)

✦array binarySearch(Object[] a, int fromIndex, int toIndex, Object key)

✦array binarySearch(Object[] a, Object key)

✦array binarySearch(short[] a, int fromIndex, int toIndex, short key)

✦array binarySearch(short[] a, short key)

✦array binarySearch(T[] a, int fromIndex, int toIndex, T key, Comparator<? super T> c)

✦array binarySearch(T[] a, T key, Comparator<? super T> c)

✦array copyOf(boolean[] original, int newLength)

✦array copyOf(byte[] original, int newLength)

✦array copyOf(char[] original, int newLength)

✦array copyOf(double[] original, int newLength)

✦array copyOf(float[] original, int newLength)

✦array copyOf(int[] original, int newLength)

✦array copyOf(long[] original, int newLength)

✦array copyOf(short[] original, int newLength)

✦array copyOf(T[] original, int newLength)

✦array copyOf(U[] original, int newLength, Class<? extends T[]> newType)

✦array copyOfRange(boolean[] original, int from, int to)

✦array copyOfRange(byte[] original, int from, int to)

✦array copyOfRange(char[] original, int from, int to)

✦array copyOfRange(double[] original, int from, int to)

✦array copyOfRange(float[] original, int from, int to)

✦array copyOfRange(int[] original, int from, int to)

✦array copyOfRange(long[] original, int from, int to)

✦array copyOfRange(short[] original, int from, int to)

✦array copyOfRange(T[] original, int from, int to)

✦array copyOfRange(U[] original, int from, int to, Class<? extends T[]> newType)

✦array deepEquals(Object[] a1, Object[] a2)

✦array deepHashCode(Object[] a)

✦array deepToString(Object[] a)

✦array equals(boolean[] a, boolean[] a2)

✦array equals(byte[] a, byte[] a2)

✦array equals(char[] a, char[] a2)

✦array equals(double[] a, double[] a2)

✦array equals(float[] a, float[] a2)

✦array equals(int[] a, int[] a2)

✦array equals(long[] a, long[] a2)

✦array equals(Object[] a, Object[] a2)

✦array equals(short[] a, short[] a2)

✦array fill(boolean[] a, boolean val)

✦array fill(boolean[] a, int fromIndex, int toIndex, boolean val)

✦array fill(byte[] a, byte val)

✦array fill(byte[] a, int fromIndex, int toIndex, byte val)

✦array fill(char[] a, char val)

✦array fill(char[] a, int fromIndex, int toIndex, char val)

✦array fill(double[] a, double val)

✦array fill(double[] a, int fromIndex, int toIndex, double val)

✦array fill(float[] a, float val)

✦array fill(float[] a, int fromIndex, int toIndex, float val)

✦array fill(int[] a, int val)

✦array fill(int[] a, int fromIndex, int toIndex, int val)

✦array fill(long[] a, int fromIndex, int toIndex, long val)

✦array fill(long[] a, long val)

✦array fill(Object[] a, int fromIndex, int toIndex, Object val)

✦array fill(Object[] a, Object val)

✦array fill(short[] a, int fromIndex, int toIndex, short val)

✦array fill(short[] a, short val)

✦array hashCode(boolean[] a)

✦array hashCode(byte[] a)

✦array hashCode(char[] a)

✦array hashCode(double[] a)

✦array hashCode(float[] a)

✦array hashCode(int[] a)

✦array hashCode(long[] a)

✦array hashCode(Object[] a)

✦array hashCode(short[] a)

✦array parallelPrefix(double[] array, DoubleBinaryOperator op)

✦array parallelPrefix(double[] array, int fromIndex, int toIndex, DoubleBinaryOperator op)

✦array parallelPrefix(int[] array, IntBinaryOperator op)

✦array parallelPrefix(int[] array, int fromIndex, int toIndex, IntBinaryOperator op)

✦array parallelPrefix(long[] array, int fromIndex, int toIndex, LongBinaryOperator op)

✦array parallelPrefix(long[] array, LongBinaryOperator op)

✦array parallelPrefix(T[] array, BinaryOperator<T> op)

✦array parallelPrefix(T[] array, int fromIndex, int toIndex, BinaryOperator<T> op)

✦array parallelSetAll(double[] array, IntToDoubleFunction generator)

✦array parallelSetAll(int[] array, IntUnaryOperator generator)

✦array parallelSetAll(long[] array, IntToLongFunction generator)

✦array parallelSetAll(T[] array, IntFunction<? extends T> generator)

✦array parallelSort(byte[] a)

✦array parallelSort(byte[] a, int fromIndex, int toIndex)

✦array parallelSort(char[] a)

✦array parallelSort(char[] a, int fromIndex, int toIndex)

✦array parallelSort(double[] a)

✦array parallelSort(double[] a, int fromIndex, int toIndex)

✦array parallelSort(float[] a)

✦array parallelSort(float[] a, int fromIndex, int toIndex)

✦array parallelSort(int[] a)

✦array parallelSort(int[] a, int fromIndex, int toIndex)

✦array parallelSort(long[] a)

✦array parallelSort(long[] a, int fromIndex, int toIndex)

✦array parallelSort(short[] a)

✦array parallelSort(short[] a, int fromIndex, int toIndex)

✦array "static <T extends Comparable<? super T>>

✦array parallelSort(T[] a)

✦array parallelSort(T[] a, Comparator<? super T> cmp)

✦array parallelSort(T[] a, int fromIndex, int toIndex)

✦array parallelSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> cmp)

✦array setAll(double[] array, IntToDoubleFunction generator)

✦array setAll(int[] array, IntUnaryOperator generator)

✦array setAll(long[] array, IntToLongFunction generator)

✦array setAll(T[] array, IntFunction<? extends T> generator)

✦array sort(byte[] a)

✦array sort(byte[] a, int fromIndex, int toIndex)

✦array sort(char[] a)

✦array sort(char[] a, int fromIndex, int toIndex)

✦array sort(double[] a)

✦array sort(double[] a, int fromIndex, int toIndex)

✦array sort(float[] a)

✦array sort(float[] a, int fromIndex, int toIndex)

✦array sort(int[] a)

✦array sort(int[] a, int fromIndex, int toIndex)

✦array sort(long[] a)

✦array sort(long[] a, int fromIndex, int toIndex)

✦array sort(Object[] a)

✦array sort(Object[] a, int fromIndex, int toIndex)

✦array sort(short[] a)

✦array sort(short[] a, int fromIndex, int toIndex)

✦array sort(T[] a, Comparator<? super T> c)

✦array sort(T[] a, int fromIndex, int toIndex, Comparator<? super T> c)

✦array spliterator(double[] array)

✦array spliterator(double[] array, int startInclusive, int endExclusive)

✦array spliterator(int[] array)

✦array spliterator(int[] array, int startInclusive, int endExclusive)

✦array spliterator(long[] array)

✦array spliterator(long[] array, int startInclusive, int endExclusive)

✦array spliterator(T[] array)

✦array spliterator(T[] array, int startInclusive, int endExclusive)

✦array stream(double[] array)

✦array stream(double[] array, int startInclusive, int endExclusive)

✦array stream(int[] array)

✦array stream(int[] array, int startInclusive, int endExclusive)

✦array stream(long[] array)

✦array stream(long[] array, int startInclusive, int endExclusive)

✦array stream(T[] array)

✦array stream(T[] array, int startInclusive, int endExclusive)

✦array toString(boolean[] a)

✦array toString(byte[] a)

✦array toString(char[] a)

✦array toString(double[] a)

✦array toString(float[] a)

✦array toString(int[] a)

✦array toString(long[] a)

✦array toString(Object[] a)

✦array toString(short[] a)

● Scanner methods

✦scanner close()

✦scanner delimiter()

✦scanner findInLine(Pattern pattern)

✦scanner findInLine(String pattern)

✦scanner findWithinHorizon(Pattern pattern, int horizon)

✦scanner findWithinHorizon(String pattern, int horizon)

✦scanner hasNext()

✦scanner hasNext(Pattern pattern)

✦scanner hasNext(String pattern)

✦scanner hasNextBigDecimal()

✦scanner hasNextBigInteger()

✦scanner hasNextBigInteger(int radix)

✦scanner hasNextBoolean()

✦scanner hasNextByte()

✦scanner hasNextByte(int radix)

✦scanner hasNextDouble()

✦scanner hasNextFloat()

✦scanner hasNextInt()

✦scanner hasNextInt(int radix)

✦scanner hasNextLine()

✦scanner hasNextLong()

✦scanner hasNextLong(int radix)

✦scanner hasNextShort()

✦scanner hasNextShort(int radix)

✦scanner ioException()

✦scanner locale()

✦scanner match()

✦scanner next()

✦scanner next(Pattern pattern)

✦scanner next(String pattern)

✦scanner nextBigDecimal()

✦scanner nextBigInteger()

✦scanner nextBigInteger(int radix)

✦scanner nextBoolean()

✦scanner nextByte()

✦scanner nextByte(int radix)

✦scanner nextDouble()

✦scanner nextFloat()

✦scanner nextInt()

✦scanner nextInt(int radix)

✦scanner nextLine()

✦scanner nextLong()

✦scanner nextLong(int radix)

✦scanner nextShort()

✦scanner nextShort(int radix)

✦scanner radix()

✦scanner remove()

✦scanner reset()

✦scanner skip(Pattern pattern)

✦scanner skip(String pattern)

✦scanner toString()

✦scanner useDelimiter(Pattern pattern)

✦scanner useDelimiter(String pattern)

✦scanner useLocale(Locale locale)

✦scanner useRadix(int radix)

● Collections methods

✦collections addAll(Collection<? super T> c, T... elements)

✦collections asLifoQueue(Deque<T> deque)

✦collections binarySearch(List<? extends Comparable<? super T>> list, T key)

✦collections binarySearch(List<? extends T> list, T key, Comparator<? super T> c)

✦collections checkedCollection(Collection<E> c, Class<E> type)

✦collections checkedList(List<E> list, Class<E> type)

✦collections checkedMap(Map<K,V> m, Class<K> keyType, Class<V> valueType)

✦collections checkedNavigableMap(NavigableMap<K,V> m, Class<K> keyType, Class<V> valueType)

✦collections checkedNavigableSet(NavigableSet<E> s, Class<E> type)

✦collections checkedQueue(Queue<E> queue, Class<E> type)

✦collections checkedSet(Set<E> s, Class<E> type)

✦collections checkedSortedMap(SortedMap<K,V> m, Class<K> keyType, Class<V> valueType)

✦collections checkedSortedSet(SortedSet<E> s, Class<E> type)

✦collections copy(List<? super T> dest, List<? extends T> src)

✦collections disjoint(Collection<?> c1, Collection<?> c2)

✦collections emptyEnumeration()

✦collections emptyIterator()

✦collections emptyList()

✦collections emptyListIterator()

✦collections emptyMap()

✦collections emptyNavigableMap()

✦collections emptyNavigableSet()

✦collections emptySet()

✦collections emptySortedMap()

✦collections emptySortedSet()

✦collections enumeration(Collection<T> c)

✦collections fill(List<? super T> list, T obj)

✦collections frequency(Collection<?> c, Object o)

✦collections indexOfSubList(List<?> source, List<?> target)

✦collections lastIndexOfSubList(List<?> source, List<?> target)

✦collections list(Enumeration<T> e)

✦collections "static <T extends Object & Comparable<? super T>>

✦collections max(Collection<? extends T> coll)

✦collections max(Collection<? extends T> coll, Comparator<? super T> comp)

✦collections min(Collection<? extends T> coll)

✦collections min(Collection<? extends T> coll, Comparator<? super T> comp)

✦collections nCopies(int n, T o)

✦collections newSetFromMap(Map<E,Boolean> map)

✦collections replaceAll(List<T> list, T oldVal, T newVal)

✦collections reverse(List<?> list)

✦collections reverseOrder()

✦collections reverseOrder(Comparator<T> cmp)

✦collections rotate(List<?> list, int distance)

✦collections shuffle(List<?> list)

✦collections shuffle(List<?> list, Random rnd)

✦collections singleton(T o)

✦collections singletonList(T o)

✦collections singletonMap(K key, V value)

✦collections "static <T extends Comparable<? super T>>

✦collections sort(List<T> list)

✦collections sort(List<T> list, Comparator<? super T> c)

✦collections swap(List<?> list, int i, int j)

✦collections synchronizedCollection(Collection<T> c)

✦collections synchronizedList(List<T> list)

✦collections synchronizedMap(Map<K,V> m)

✦collections synchronizedNavigableMap(NavigableMap<K,V> m)

✦collections synchronizedNavigableSet(NavigableSet<T> s)

✦collections synchronizedSet(Set<T> s)

✦collections synchronizedSortedMap(SortedMap<K,V> m)

✦collections synchronizedSortedSet(SortedSet<T> s)

✦collections unmodifiableCollection(Collection<? extends T> c)

✦collections unmodifiableList(List<? extends T> list)

✦collections unmodifiableMap(Map<? extends K,? extends V> m)

✦collections unmodifiableNavigableMap(NavigableMap<K,? extends V> m)

✦collections unmodifiableNavigableSet(NavigableSet<T> s)

✦collections unmodifiableSet(Set<? extends T> s)

✦collections unmodifiableSortedMap(SortedMap<K,? extends V> m)

✦collections unmodifiableSortedSet(SortedSet<T> s)

● Set methods

✦set add(E e)

✦set addAll(Collection<? extends E> c)

✦set clear()

✦set contains(Object o)

✦set containsAll(Collection<?> c)

✦set equals(Object o)

✦set hashCode()

✦set isEmpty()

✦set iterator()

✦set remove(Object o)

✦set removeAll(Collection<?> c)

✦set retainAll(Collection<?> c)

✦set size()

✦set spliterator()

✦set toArray()

✦set toArray(T[] a)

● List methods

✦list add(E e)

✦list add(int index, E element)

✦list addAll(Collection<? extends E> c)

✦list addAll(int index, Collection<? extends E> c)

✦list clear()

✦list contains(Object o)

✦list containsAll(Collection<?> c)

✦list equals(Object o)

✦list get(int index)

✦list hashCode()

✦list indexOf(Object o)

✦list isEmpty()

✦list iterator()

✦list lastIndexOf(Object o)

✦list listIterator()

✦list listIterator(int index)

✦list remove(int index)

✦list remove(Object o)

✦list removeAll(Collection<?> c)

✦list replaceAll(UnaryOperator<E> operator)

✦list retainAll(Collection<?> c)

✦list set(int index, E element)

✦list size()

✦list sort(Comparator<? super E> c)

✦list spliterator()

✦list subList(int fromIndex, int toIndex)

✦list toArray()

✦list toArray(T[] a)

● Queue methods

✦queue add(E e)

✦queue element()

✦queue offer(E e)

✦queue peek()

✦queue poll()

✦queue remove()

● Map methods

✦map clear()

✦map compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)

✦map computeIfAbsent(K key, Function<? super K,? extends V> mappingFunction)

✦map computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)

✦map containsKey(Object key)

✦map containsValue(Object value)

✦map entrySet()

✦map equals(Object o)

✦map forEach(BiConsumer<? super K,? super V> action)

✦map get(Object key)

✦map getOrDefault(Object key, V defaultValue)

✦map hashCode()

✦map isEmpty()

✦map keySet()

✦map merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)

✦map put(K key, V value)

✦map putAll(Map<? extends K,? extends V> m)

✦map putIfAbsent(K key, V value)

✦map remove(Object key)

✦map remove(Object key, Object value)

✦map replace(K key, V value)

✦map replace(K key, V oldValue, V newValue)

✦map replaceAll(BiFunction<? super K,? super V,? extends V> function)

✦map size()

✦map values()

● Sortedset methods

✦sortedset comparator()

✦sortedset first()

✦sortedset headSet(E toElement)

✦sortedset last()

✦sortedset spliterator()

✦sortedset subSet(E fromElement, E toElement)

✦sortedset tailSet(E fromElement)

● Sortedmap methods

✦Sortedmap comparator()

✦Sortedmap entrySet()

✦Sortedmap firstKey()

✦Sortedmap headMap(K toKey)

✦Sortedmap keySet()

✦Sortedmap lastKey()

✦Sortedmap subMap(K fromKey, K toKey)

✦Sortedmap tailMap(K fromKey)

✦Sortedmap values()

● Arraylist methods

✦Arraylist add(E e)

✦Arraylist add(int index, E element)

✦Arraylist addAll(Collection<? extends E> c)

✦Arraylist addAll(int index, Collection<? extends E> c)

✦Arraylist clear()

✦Arraylist clone()

✦Arraylist contains(Object o)

✦Arraylist ensureCapacity(int minCapacity)

✦Arraylist forEach(Consumer<? super E> action)

✦Arraylist get(int index)

✦Arraylist indexOf(Object o)

✦Arraylist isEmpty()

✦Arraylist iterator()

✦Arraylist lastIndexOf(Object o)

✦Arraylist listIterator()

✦Arraylist listIterator(int index)

✦Arraylist remove(int index)

✦Arraylist remove(Object o)

✦Arraylist removeAll(Collection<?> c)

✦Arraylist removeIf(Predicate<? super E> filter)

✦Arraylist removeRange(int fromIndex, int toIndex)

✦Arraylist replaceAll(UnaryOperator<E> operator)

✦Arraylist retainAll(Collection<?> c)

✦Arraylist set(int index, E element)

✦Arraylist size()

✦Arraylist sort(Comparator<? super E> c)

✦Arraylist spliterator()

✦Arraylist subList(int fromIndex, int toIndex)

✦Arraylist toArray()

✦Arraylist toArray(T[] a)

✦Arraylist trimToSize()

● Linkedlist methods

✦linkedlist add(E e)

✦linkedlist add(int index, E element)

✦linkedlist addAll(Collection<? extends E> c)

✦linkedlist addAll(int index, Collection<? extends E> c)

✦linkedlist addFirst(E e)

✦linkedlist addLast(E e)

✦linkedlist clear()

✦linkedlist clone()

✦linkedlist contains(Object o)

✦linkedlist descendingIterator()

✦linkedlist element()

✦linkedlist get(int index)

✦linkedlist getFirst()

✦linkedlist getLast()

✦linkedlist indexOf(Object o)

✦linkedlist lastIndexOf(Object o)

✦linkedlist listIterator(int index)

✦linkedlist offer(E e)

✦linkedlist offerFirst(E e)

✦linkedlist offerLast(E e)

✦linkedlist peek()

✦linkedlist peekFirst()

✦linkedlist peekLast()

✦linkedlist poll()

✦linkedlist pollFirst()

✦linkedlist pollLast()

✦linkedlist pop()

✦linkedlist push(E e)

✦linkedlist remove()

✦linkedlist remove(int index)

✦linkedlist remove(Object o)

✦linkedlist removeFirst()

✦linkedlist removeFirstOccurrence(Object o)

✦linkedlist removeLast()

✦linkedlist removeLastOccurrence(Object o)

✦linkedlist set(int index, E element)

✦linkedlist size()

✦linkedlist spliterator()

✦linkedlist toArray()

✦linkedlist toArray(T[] a)

● Vector methods

✦vector add(E e)

✦vector add(int index, E element)

✦vector addAll(Collection<? extends E> c)

✦vector addAll(int index, Collection<? extends E> c)

✦vector addElement(E obj)

✦vector capacity()

✦vector clear()

✦vector clone()

✦vector contains(Object o)

✦vector containsAll(Collection<?> c)

✦vector copyInto(Object[] anArray)

✦vector elementAt(int index)

✦vector elements()

✦vector ensureCapacity(int minCapacity)

✦vector equals(Object o)

✦vector firstElement()

✦vector forEach(Consumer<? super E> action)

✦vector get(int index)

✦vector hashCode()

✦vector indexOf(Object o)

✦vector indexOf(Object o, int index)

✦vector insertElementAt(E obj, int index)

✦vector isEmpty()

✦vector iterator()

✦vector lastElement()

✦vector lastIndexOf(Object o)

✦vector lastIndexOf(Object o, int index)

✦vector listIterator()

✦vector listIterator(int index)

✦vector remove(int index)

✦vector remove(Object o)

✦vector removeAll(Collection<?> c)

✦vector removeAllElements()

✦vector removeElement(Object obj)

✦vector removeElementAt(int index)

✦vector removeIf(Predicate<? super E> filter)

✦vector removeRange(int fromIndex, int toIndex)

✦vector replaceAll(UnaryOperator<E> operator)

✦vector retainAll(Collection<?> c)

✦vector set(int index, E element)

✦vector setElementAt(E obj, int index)

✦vector setSize(int newSize)

✦vector size()

✦vector sort(Comparator<? super E> c)

✦vector spliterator()

✦vector subList(int fromIndex, int toIndex)

✦vector toArray()

✦vector toArray(T[] a)

✦vector toString()

✦vector trimToSize()

● Hashset methods

✦hashset add(E e)

✦hashset clear()

✦hashset clone()

✦hashset contains(Object o)

✦hashset isEmpty()

✦hashset iterator()

✦hashset remove(Object o)

✦hashset size()

✦hashset spliterator()

● Treeset methods

✦treeset add(E e)

✦treeset addAll(Collection<? extends E> c)

✦treeset ceiling(E e)

✦treeset clear()

✦treeset clone()

✦treeset comparator()

✦treeset contains(Object o)

✦treeset descendingIterator()

✦treeset descendingSet()

✦treeset first()

✦treeset floor(E e)

✦treeset headSet(E toElement)

✦treeset headSet(E toElement, boolean inclusive)

✦treeset higher(E e)

✦treeset isEmpty()

✦treeset iterator()

✦treeset last()

✦treeset lower(E e)

✦treeset pollFirst()

✦treeset pollLast()

✦treeset remove(Object o)

✦treeset size()

✦treeset spliterator()

✦treeset subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)

✦treeset subSet(E fromElement, E toElement)

✦treeset tailSet(E fromElement)

✦treeset tailSet(E fromElement, boolean inclusive)

● Hashmap methods

✦hashmap clear()

✦hashmap clone()

✦hashmap compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)

✦hashmap computeIfAbsent(K key, Function<? super K,? extends V> mappingFunction)

✦hashmap computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)

✦hashmap containsKey(Object key)

✦hashmap containsValue(Object value)

✦hashmap entrySet()

✦hashmap forEach(BiConsumer<? super K,? super V> action)

✦hashmap get(Object key)

✦hashmap getOrDefault(Object key, V defaultValue)

✦hashmap isEmpty()

✦hashmap keySet()

✦hashmap merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)

✦hashmap put(K key, V value)

✦hashmap putAll(Map<? extends K,? extends V> m)

✦hashmap putIfAbsent(K key, V value)

✦hashmap remove(Object key)

✦hashmap remove(Object key, Object value)

✦hashmap replace(K key, V value)

✦hashmap replace(K key, V oldValue, V newValue)

✦hashmap replaceAll(BiFunction<? super K,? super V,? extends V> function)

✦hashmap size()

✦hashmap values()

● Linkedhashmap methods

✦linkedhashmap clear()

✦linkedhashmap containsValue(Object value)

✦linkedhashmap entrySet()

✦linkedhashmap forEach(BiConsumer<? super K,? super V> action)

✦linkedhashmap get(Object key)

✦linkedhashmap getOrDefault(Object key, V defaultValue)

✦linkedhashmap keySet()

✦linkedhashmap removeEldestEntry(Map.Entry<K,V> eldest)

✦linkedhashmap replaceAll(BiFunction<? super K,? super V,? extends V> function)

✦linkedhashmap values()

● Treemap methods

✦treemap ceilingEntry(K key)

✦treemap ceilingKey(K key)

✦treemap clear()

✦treemap clone()

✦treemap comparator()

✦treemap containsKey(Object key)

✦treemap containsValue(Object value)

✦treemap descendingKeySet()

✦treemap descendingMap()

✦treemap entrySet()

✦treemap firstEntry()

✦treemap firstKey()

✦treemap floorEntry(K key)

✦treemap floorKey(K key)

✦treemap forEach(BiConsumer<? super K,? super V> action)

✦treemap get(Object key)

✦treemap headMap(K toKey)

✦treemap headMap(K toKey, boolean inclusive)

✦treemap higherEntry(K key)

✦treemap higherKey(K key)

✦treemap keySet()

✦treemap lastEntry()

✦treemap lastKey()

✦treemap lowerEntry(K key)

✦treemap lowerKey(K key)

✦treemap navigableKeySet()

✦treemap pollFirstEntry()

✦treemap pollLastEntry()

✦treemap put(K key, V value)

✦treemap putAll(Map<? extends K,? extends V> map)

✦treemap remove(Object key)

✦treemap replace(K key, V value)

✦treemap replace(K key, V oldValue, V newValue)

✦treemap replaceAll(BiFunction<? super K,? super V,? extends V> function)

✦treemap size()

✦treemap subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)

✦treemap subMap(K fromKey, K toKey)

✦treemap tailMap(K fromKey)

✦treemap tailMap(K fromKey, boolean inclusive)

✦treemap values()

● Identifyhashmap methods

✦identifyhashmap clear()

✦identifyhashmap clone()

✦identifyhashmap containsKey(Object key)

✦identifyhashmap containsValue(Object value)

✦identifyhashmap entrySet()

✦identifyhashmap equals(Object o)

✦identifyhashmap forEach(BiConsumer<? super K,? super V> action)

✦identifyhashmap get(Object key)

✦identifyhashmap hashCode()

✦identifyhashmap isEmpty()

✦identifyhashmap keySet()

✦identifyhashmap put(K key, V value)

✦identifyhashmap putAll(Map<? extends K,? extends V> m)

✦identifyhashmap remove(Object key)

✦identifyhashmap replaceAll(BiFunction<? super K,? super V,? extends V> function)

✦identifyhashmap size()

✦identifyhashmap values()

● Weakhashmap methods

✦weakhashmap clear()

✦weakhashmap containsKey(Object key)

✦weakhashmap containsValue(Object value)

✦weakhashmap entrySet()

✦weakhashmap forEach(BiConsumer<? super K,? super V> action)

✦weakhashmap get(Object key)

✦weakhashmap isEmpty()

✦weakhashmap keySet()

✦weakhashmap put(K key, V value)

✦weakhashmap putAll(Map<? extends K,? extends V> m)

✦weakhashmap remove(Object key)

✦weakhashmap replaceAll(BiFunction<? super K,? super V,? extends V> function)

✦weakhashmap size()

✦weakhashmap values()

● Enumset methods

✦enumset clone()

✦enumset complementOf(EnumSet<E> s)

✦enumset copyOf(Collection<E> c)

✦enumset copyOf(EnumSet<E> s)

✦enumset noneOf(Class<E> elementType)

✦enumset of(E e)

✦enumset of(E first, E... rest)

✦enumset of(E e1, E e2)

✦enumset of(E e1, E e2, E e3)

✦enumset of(E e1, E e2, E e3, E e4)

✦enumset of(E e1, E e2, E e3, E e4, E e5)

✦enumset range(E from, E to)

● Enummap methods

✦enummap clear()

✦enummap clone()

✦enummap containsKey(Object key)

✦enummap containsValue(Object value)

✦enummap entrySet()

✦enummap equals(Object o)

✦enummap get(Object key)

✦enummap hashCode()

✦enummap keySet()

✦enummap put(K key, V value)

✦enummap putAll(Map<? extends K,? extends V> m)

✦enummap remove(Object key)

✦enummap size()

✦enummap values()

● Arraydequeue methods

✦arraydeque add(E e)

✦arraydeque addFirst(E e)

✦arraydeque addLast(E e)

✦arraydeque clear()

✦arraydeque clone()

✦arraydeque contains(Object o)

✦arraydeque descendingIterator()

✦arraydeque element()

✦arraydeque getFirst()

✦arraydeque getLast()

✦arraydeque isEmpty()

✦arraydeque iterator()

✦arraydeque offer(E e)

✦arraydeque offerFirst(E e)

✦arraydeque offerLast(E e)

✦arraydeque peek()

✦arraydeque peekFirst()

✦arraydeque peekLast()

✦arraydeque poll()

✦arraydeque pollFirst()

✦arraydeque pollLast()

✦arraydeque pop()

✦arraydeque push(E e)

✦arraydeque remove()

✦arraydeque remove(Object o)

✦arraydeque removeFirst()

✦arraydeque removeFirstOccurrence(Object o)

✦arraydeque removeLast()

✦arraydeque removeLastOccurrence(Object o)

✦arraydeque size()

✦arraydeque spliterator()

✦arraydeque toArray()

✦arraydeque toArray(T[] a)

● Priorityqueue methods

✦priorityqueue add(E e)

✦priorityqueue clear()

✦priorityqueue comparator()

✦priorityqueue contains(Object o)

✦priorityqueue iterator()

✦priorityqueue offer(E e)

✦priorityqueue peek()

✦priorityqueue poll()

✦priorityqueue remove(Object o)

✦priorityqueue size()

✦priorityqueue spliterator()

✦priorityqueue toArray()

✦priorityqueue toArray(T[] a)

Set methods → set isEmpty()

Tutorials

Popular Languages

All Interpreters/IDE

vb.net(visualbasic)

Quick Links

Advertise with us About us Contact us Disclaimer Privacy Policy Terms & Conditions

© 2025 Tutorialix.com. All rights reserved.